Computing Helmert transformations
نویسنده
چکیده
The Helmert transformation is used in geodesy. It transforms a set of points into another by rotation, scaling and translation. When both sets of points are given, then least squares can be used to solve the inverse problem of determining the parameters. In particular, the parameters of the so-called 7 parameter transformation can be obtained by standard methods. In this note, it is shown how a Gauss-Newton method in the rotation parameters alone can easily be implemented to determine the parameters of the 9 parameter transformation (when different scale factors for the variables are needed).
منابع مشابه
Better Orders for Saturated Cost Partitioning in Optimal Classical Planning
Cost partitioning is a general method for adding multiple heuristic values admissibly. In the setting of optimal classical planning, saturated cost partitioning has recently been shown to be the cost partitioning algorithm of choice for pattern database heuristics found by hill climbing, systematic pattern database heuristics and Cartesian abstraction heuristics. To evaluate the synergy of the ...
متن کاملSoCS 2013 Organization
Christer Bäckström (Linköping University, Sweden) Jorge Baier (PUC Chile, Chile) Roman Barták (Charles University, Czech Republic) Hannah Bast (University of Freiburg, Germany) Chris Beck (University of Toronto, Canada) Kostas Bekris (Rutgers University, USA) J. Benton (Smart Information Flow Technologies – SIFT, USA) Blai Bonet (Universidad Simon Bolivar, Venezuela) Daniel Borrajo (Universidad...
متن کاملEnhancing the Context-Enhanced Additive Heuristic with Precedence Constraints
Recently, Helmert and Geffner proposed the context-enhanced additive heuristic, where fact costs are evaluated relative to context states that arise from achieving first a pivot condition of each operator. As Helmert and Geffner pointed out, the method can be generalized to consider contexts arising from arbitrary precedence constraints over operator conditions instead. Herein, we provide such ...
متن کاملGetting the Most Out of Pattern Databases for Classical Planning
The iPDB procedure by Haslum et al. is the stateof-the-art method for computing additive abstraction heuristics for domain-independent planning. It performs a hill-climbing search in the space of pattern collections, combining information from multiple patterns in the so-called canonical heuristic. We show how stronger heuristic estimates can be obtained through linear programming. An experimen...
متن کاملAbstraction Heuristics, Cost Partitioning and Network Flows
ion Heuristics, Cost Partitioning and Network Flows Florian Pommerening and Malte Helmert University of Basel, Switzerland {florian.pommerening, malte.helmert}@unibas.ch Blai Bonet Universidad Simón Bolívar, Caracas, Venezuela [email protected]
متن کامل